Irreducibility of tensor squares, symmetric squares and alternating squares
نویسندگان
چکیده
منابع مشابه
Irreducibility of Tensor Squares, Symmetric Squares and Alternating Squares
We investigate the question when the tensor square, the alternating square, or the symmetric square of an absolutely irreducible projective representation V of an almost simple group G is again irreducible. The knowledge of such representations is of importance in the description of the maximal subgroups of simple classical groups of Lie type. We show that if G is of Lie type in odd characteris...
متن کاملTensor Decompositions, Alternating Least Squares and other Tales
This work was originally motivated by a classification of tensors proposed by Richard Harshman. In particular, we focus on simple and multiple “bottlenecks”, and on “swamps”. Existing theoretical results are surveyed, some numerical algorithms are described in details, and their numerical complexity is calculated. In particular, the interest in using the ELS enhancement in these algorithms is d...
متن کاملSymmetric squares of graphs
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of more general graphs. The connection with generic exchange Hamiltonians in quantum mechanics is discussed in an appendix.
متن کاملDMS: Distributed Sparse Tensor Factorization with Alternating Least Squares
Tensors are data structures indexed along three or more dimensions. Tensors have found increasing use in domains such as data mining and recommender systems where dimensions can have enormous length and are resultingly very sparse. The canonical polyadic decomposition (CPD) is a popular tensor factorization for discovering latent features and is most commonly found via the method of alternating...
متن کاملUnifying Least Squares, Total Least Squares and Data Least Squares
The standard approaches to solving overdetermined linear systems Ax ≈ b construct minimal corrections to the vector b and/or the matrix A such that the corrected system is compatible. In ordinary least squares (LS) the correction is restricted to b, while in data least squares (DLS) it is restricted to A. In scaled total least squares (Scaled TLS) [15], corrections to both b and A are allowed, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2002
ISSN: 0030-8730
DOI: 10.2140/pjm.2002.202.379